Large language models (LLMs) have been shown to be able to perform new tasks based on a few demonstrations or natural language instructions. While these capabilities have led to widespread adoption, most LLMs are developed by resource-rich organizations and are frequently kept from the public. As a step towards democratizing this powerful technology, we present BLOOM, a 176B-parameter open-access language model designed and built thanks to a collaboration of hundreds of researchers. BLOOM is a decoder-only Transformer language model that was trained on the ROOTS corpus, a dataset comprising hundreds of sources in 46 natural and 13 programming languages (59 in total). We find that BLOOM achieves competitive performance on a wide variety of benchmarks, with stronger results after undergoing multitask prompted finetuning. To facilitate future research and applications using LLMs, we publicly release our models and code under the Responsible AI License.

在本文中，我们提出了一个新的低级矩阵分解模型，称为有界的单纯形成矩阵分解（BSSMF）。给定输入矩阵$ x $和一个分解等级$ r $，BSSMF寻找带有$ r $ lum $ $ columns的矩阵$ w $和a矩阵$ h $，带有$ r $行，以便$ x \ lot在$ w $的每一列中，都有边界，也就是说，它们属于给定的间隔，$ h $的列属于概率单纯词，即，$ h $是列随机。 BSSMF概括了非负矩阵分解（NMF）和单纯结构的矩阵分解（SSMF）。当输入矩阵$ x $的条目属于给定间隔时，BSSMF特别适合。例如，当$ x $的行代表图像时，或$ x $是一个额定矩阵，例如在Netflix和Movielens数据集中，其中$ x $的条目属于Interval $ [1,5] $。单纯结构的矩阵$ h $不仅导致易于理解的分解，从而提供了$ x $的列的软聚类，而且暗示着$ wh $的每个列的条目属于与$的列的相同间隔W $。在本文中，我们首先提出了BSSMF的快速算法，即使在$ x $中缺少数据的情况下。然后，我们为BSSMF提供可识别性条件，也就是说，我们提供了BSSMF承认独特分解的条件，直到微不足道的歧义。最后，我们说明了BSSMF对两个应用程序的有效性：在一组图像中提取特征，以及推荐系统的矩阵完成问题。

现有的最新3D点云实例分割方法依赖于基于分组的方法，该方法指向获得对象实例。尽管产生准确的分割结果方面有所改善，但这些方法缺乏可扩展性，通常需要将大量输入分为多个部分。为了处理数百万点的场景，现有的最快方法软组\ cite {vu2022222222222222222222222222222222222222ggroup}需要数十秒钟，这是满意的。我们的发现是，$ k $ neart的邻居（$ k $ -nn）是分组的先决条件，是计算瓶颈。这种瓶颈严重使现场的推理时间恶化了很多。本文提出了软组++来解决此计算瓶颈，并进一步优化了整个网络的推理速度。 SoftGroup ++建立在软组上，这在三个重要方面有所不同：（1）执行OCTREE $ K $ -NN而不是Vanilla $ k $ -nn，以将时间复杂性从$ \ Mathcal {o}（n^2）缩短到$ \ Mathcal {o}（n \ log n）$，（2）执行金字塔缩放，适应性下降样本骨干输出以减少$ k $ -nn和分组的搜索空间，并且（3）执行后期的Devoxelization，延迟了Voxels的转换指向模型的结束，以使中间组件以低计算成本运行。在各种室内和室外数据集上进行了广泛的实验，证明了拟议的软组++的功效。值得注意的是，SoftGroup ++在一个前方的情况下通过单个前方进行了大量的场景，而无需将输入分为多个部分，从而丰富了上下文信息。特别是，SoftGroup ++达到2.4点AP $ _ {50} $改进，而$ 6 \ $ 6 \ times $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $。代码和训练有素的模型将公开可用。

来自3D点云的对象重建在计算机视觉和计算机图形研究字段中取得了令人印象深刻的进展。但是，通常会忽略时间变化点云（又称4D点云）的重建。在本文中，我们提出了一种新的网络体系结构，即RFNET-4D，它共同重建对象及其运动从4D点云中流动。关键见解是，通过一系列点云的学习空间和时间特征同时执行这两个任务可以利用单个任务，从而改善了整体性能。为了证明这种能力，我们使用无监督的学习方法来设计一个时间矢量场学习模块，以进行流程估计，并通过监督对物体重建的空间结构的监督学习来利用。基准数据集的广泛实验和分析验证了我们方法的有效性和效率。如实验结果所示，我们的方法在流动估计和对象重建方面都达到了最先进的性能，同时执行训练和推理中的现有方法要快得多。我们的代码和数据可从https://github.com/hkust-vgd/rfnet-4d获得

在电压负载下，已被认为是在紧急情况下恢复电力电网电压稳定性的标准方法，但该方案通常越来越大的负载量。加强学习（RL）被采用作为一种有希望的方法来规避问题;但是，RL方法通常不能保证控制系统的安全性。在本文中，我们讨论了一些新的安全R1方法，即限制优化方法和基于障碍功能的方法，可以在紧急事件下安全地恢复电压。该方法是一般的，可以应用于其他安全关键控制问题。进行了39母线IEEE基准测试的数值模拟，以证明所提出的安全RL紧急控制的有效性。

自动编辑后（APE）是减少通过机器翻译（MT）系统或软件辅助翻译产生的原始翻译文本错误的重要补救措施。在本文中，我们提出了一种系统的方法来解决越南人的APE任务。具体来说，我们构建了5M越南翻译和纠正句对的第一个大规模数据集。然后，我们使用由构造的数据集应用强大的神经MT模型来处理APE任务。自动和人类评估的实验结果表明了神经MT模型在处理越南APE任务方面的有效性。

In this paper, we propose a novel technique, namely INVALIDATOR, to automatically assess the correctness of APR-generated patches via semantic and syntactic reasoning. INVALIDATOR reasons about program semantic via program invariants while it also captures program syntax via language semantic learned from large code corpus using the pre-trained language model. Given a buggy program and the developer-patched program, INVALIDATOR infers likely invariants on both programs. Then, INVALIDATOR determines that a APR-generated patch overfits if: (1) it violates correct specifications or (2) maintains errors behaviors of the original buggy program. In case our approach fails to determine an overfitting patch based on invariants, INVALIDATOR utilizes a trained model from labeled patches to assess patch correctness based on program syntax. The benefit of INVALIDATOR is three-fold. First, INVALIDATOR is able to leverage both semantic and syntactic reasoning to enhance its discriminant capability. Second, INVALIDATOR does not require new test cases to be generated but instead only relies on the current test suite and uses invariant inference to generalize the behaviors of a program. Third, INVALIDATOR is fully automated. We have conducted our experiments on a dataset of 885 patches generated on real-world programs in Defects4J. Experiment results show that INVALIDATOR correctly classified 79% overfitting patches, accounting for 23% more overfitting patches being detected by the best baseline. INVALIDATOR also substantially outperforms the best baselines by 14% and 19% in terms of Accuracy and F-Measure, respectively.

We propose a new causal inference framework to learn causal effects from multiple, decentralized data sources in a federated setting. We introduce an adaptive transfer algorithm that learns the similarities among the data sources by utilizing Random Fourier Features to disentangle the loss function into multiple components, each of which is associated with a data source. The data sources may have different distributions; the causal effects are independently and systematically incorporated. The proposed method estimates the similarities among the sources through transfer coefficients, and hence requiring no prior information about the similarity measures. The heterogeneous causal effects can be estimated with no sharing of the raw training data among the sources, thus minimizing the risk of privacy leak. We also provide minimax lower bounds to assess the quality of the parameters learned from the disparate sources. The proposed method is empirically shown to outperform the baselines on decentralized data sources with dissimilar distributions.

In this work, we propose a new approach that combines data from multiple sensors for reliable obstacle avoidance. The sensors include two depth cameras and a LiDAR arranged so that they can capture the whole 3D area in front of the robot and a 2D slide around it. To fuse the data from these sensors, we first use an external camera as a reference to combine data from two depth cameras. A projection technique is then introduced to convert the 3D point cloud data of the cameras to its 2D correspondence. An obstacle avoidance algorithm is then developed based on the dynamic window approach. A number of experiments have been conducted to evaluate our proposed approach. The results show that the robot can effectively avoid static and dynamic obstacles of different shapes and sizes in different environments.

Knowledge representation and reasoning in law are essential to facilitate the automation of legal analysis and decision-making tasks. In this paper, we propose a new approach based on legal science, specifically legal taxonomy, for representing and reasoning with legal documents. Our approach interprets the regulations in legal documents as binary trees, which facilitates legal reasoning systems to make decisions and resolve logical contradictions. The advantages of this approach are twofold. First, legal reasoning can be performed on the basis of the binary tree representation of the regulations. Second, the binary tree representation of the regulations is more understandable than the existing sentence-based representations. We provide an example of how our approach can be used to interpret the regulations in a legal document.